例文Binary search functions, for example, have a maximum complexity of O ( log ( n ) ), or logarithmic time.